STRONG CONVERGENCE OF SOME ALGORITHMS FOR λ-STRICT PSEUDO-CONTRACTIONS IN HILBERT SPACE

An intermixed algorithm for strict pseudo-contractions in Hilbert spaces

*Correspondence: [email protected] 2Department of Mathematics and the RINS, Gyeongsang National University, Jinju, 660-701, Korea Full list of author information is available at the end of the article Abstract An intermixed algorithm for two strict pseudo-contractions in Hilbert spaces have been presented. It is shown that the suggested algorithms converge strongly to the fixed points of two str...

Strong Convergence for the Mann Iteration of Λ-strict Pseudo-contraction

In this paper, we prove strong convergence of the Mann iteration of an λ-strict pseudocontraction T in a real q−uniformly smooth Banach space. The results presented in this paper are interesting extensions and improvements upon those known ones of Marino and Xu [J. Math. Anal. Appl. 324(2007) 336-349], and are development and complementariness of the corresponding ones of Chai and Song [Fixed P...

Strong convergence of the modified Mann iterative method for strict pseudo-contractions

In this paper, we introduce amodifiedMann iterative process for approximating a common fixedpoint of a finite family of strict pseudo-contractions inHilbert spaces.We establish the strong convergence theorem of the general iteration scheme under some mild conditions. Our results extend and improve the recent ones announced by many others. © 2008 Elsevier Ltd. All rights reserved.

Weak and Strong Convergence Theorems for Equilibrium Problems and Countable Strict Pseudocontractions Mappings in Hilbert Space

Weak and Strong Convergence Theorems for k-Strictly Pseudo-Contractive in Hilbert Space

LetK be a nonempty closed convex subset of a real Hilbert space H , and assume that Ti : K → H, i = 1, 2...N be a finite family of ki-strictly pseudo-contractive mappings for some 0 ≤ ki ≤ 1 such that ⋂N i=1 F (Ti) = {x ∈ K : x = Tix, i = 1, 2...N} = ∅. For the following iterative algorithm in K, for x1, x ′ 1 ∈ K and u ∈ K, { yn = PK [kxn + (1− k)Σi=1λiTixn] xn+1 = βnxn + (1− βn)yn and { y′ n ...